A Non-partitioning File Assignment Scheme with Approximating Average Waiting Time in Parallel I/O System

نویسندگان

  • Nianmin Yao
  • Jinzhong Chen
  • Shaobin Cai
چکیده

As storage system runs an increasing variety of workload, there may be many file requests do not dispatch for a long time. The web clients who wait a long time will leave away. This paper presents a novel non-partitioning file assignment strategy called Static Approximate Fairness algorithm (SAF) in parallel I/O system. The SAF algorithm aims at obtaining approximate mean waiting time for disk file requests, as well as making load balancing in parallel I/O system. The approximate mean waiting time provides the same chance to serve different web clients. The technique we applied is referred to as open queuing network model. The SAF algorithm first selects files according to file load. Next, it assigns files to different disks until reaching their average load. The goal of fairness is obtained by assigning files to disks in terms of file load. Comprehensive experimental results indicated our new algorithm is superior to Sort Partition (SP) in terms of fairness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profile-Guided File Partitioning on Beowulf Clusters

On cluster-based systems, data is typically stored on a centralized resource, and each node has a local disk used for the operating system and swap space. Although I/O middlewares (e.g., MPI-IO) and high performance I/O subsystems (e.g., RAID) can generate parallel I/O streams, disk contention and network latency still dominate I/O performance. To address this performance barrier, I/O access ne...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

File Assignment in Parallel I/O Systems with Minimal Variance of Service Time

ÐWe address the problem of assigning nonpartitioned files in a parallel I/O system where the file accesses exhibit Poisson arrival rates and fixed service times. We present two new file assignment algorithms based on open queuing networks which aim at minimizing simultaneously the load balance across all disks, as well as the variance of the service time at each disk. We first present an off-li...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013